A Functional Solution to the RPC Memory Speci cation Problem
نویسنده
چکیده
We give a functional speci cation of the syntactic interface and the black box behavior of an unreliable and a reliable memory com ponent and a remote procedure RPC call component The RPC com ponent controls the access to the memory In addition we specify a clerk for driving the RPC component The used method is modular and there fore it allows us to specify each of these components independently and separately We discuss the speci cations shortly and then compose them into a distributed system of interacting components We prove that the speci cation of the composed system ful lls again the requirement spec i cation of the unreliable memory component Finally we give a timed version of the RPC component and of a clerk component and compose them
منابع مشابه
A TLA Solution to the RPC-Memory Specification Problem
We present a complete solution to the Broy Lamport speci cation problem Our speci cations are written in TLA a formal lan guage based on TLA We give the high levels of structured proofs and sketch the lower levels which will appear in full elsewhere
متن کاملThe RPC-Memory Case Study: A Synopsis
The RPC Memory speci cation problem was proposed by Broy and Lamport as a case study in the formal design of distributed and concurrent systems The idea was to use it as a basis for comparing various approaches to formal speci ca tion re nement and veri cation Various preliminary solutions were presented and discussed during a workshop at Schloss Dagstuhl Germany in September Authors were then ...
متن کاملA Memory Module Specification Using Composable High-Level Petri Nets
This paper describes a solution of the RPC-memory speci-cation problem deened by M. Broy and L. Lamport on the occasion of a Dagstuhl seminar in 1994. The approach is based on a recently developed model of composable high-level Petri nets called M-nets, on which CCS-like composition operations such as parallel composition, restriction and transition synchronisation are deened. Correctness proof...
متن کاملThe RPC - Memory Speci cation Problem : UNITY plus Re nement
In this paper, we use the ImpUNITY framework to solve the \RPC-Memory Speciication problem" of the Dagstuhl Workshop on reactive systems. ImpUNITY supports the development of parallel and distributed programs from speciication to implementation in a step-wise manner. It is an extension of UNITY, as introduced by Chandy and Misra, with features of the Action System formalism of Back and Kurki-Su...
متن کاملDistributed Diners From UNITY Speci cation to CC Implementation
Resource con icts may typically be described as the dining philoso phers problem or diners for short In this report we derive a distributed message passing solution to the diners problem from the shared memory solution presented in CM Ch Dining Philosophers We de ne an isomorphism between variables in the shared memory state and variables in the distributed state This allows us to translate the...
متن کامل